An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm
نویسندگان
چکیده
We describe an implementation of the Hopcroft and Tarjan planarity test and em bedding algorithm The program tests the planarity of the input graph and either constructs a combinatorial embedding if the graph is planar or exhibits a Kuratowski subgraph if the graph is non planar
منابع مشابه
The Hopcroft-Tarjan Planarity Algorithm
This is an expository article on the Hopcroft-Tarjan planarity algorithm. A graph-theoretic analysis of a version of the algorithm is presented. An explicit formula is given for determining which vertex to place first in the adjacency list of any vertex. The intention is to make the Hopcroft-Tarjan algorithm more accessible and intuitive than it currently is.
متن کاملTrémaux Trees and Planarity
We present two characterizations of planarity based on Trémaux trees (i.e. DFS trees). From the last one, we deduce a simple and efficient planarity test algorithm which is eventually a new implementation of the Hopcroft Tarjan planarity algorithm. We finally recall a theorem on “cotree critical non-planar graphs” which very much simplify the search of a Kuratowski subdivision in a non-planar g...
متن کاملA New Planarity Test
Given an undirected graph, the planarity testing problem is to determine whether the graph can be drawn in the plane without any crossing edges. Linear time planarity testing algorithms have previously been designed by Hopcroft and Tarjan, and by Booth and Lueker. However, their approaches are quite involved. Several other approaches have also been developed for simplifying the planariy test. I...
متن کامل1 a New Planarity Test
Given an undirected graph, the planarity testing problem is to determine whether the graph can be drawn in the plane without any crossing edges. Linear time planarity testing algorithms have previously been designed by Hopcroft and Tarjan, and by Booth and Lueker. However, their approaches are quite involved. Several other approaches have also been developed for simplifying the planariy test. I...
متن کاملA Linear Algorithm for Embedding Planar Graphs Using PQ-Trees
This paper presents a simple linear algorithm for embedding (or drawing) a planar graph in the plane. The algorithm is based on the “vertex-addition” algorithm of Lempel, Even, and Cederbaum (“Theory of Graphs,” Intl. Sympos. Rome, July 1966, pp. 21>232, Gordon & Breach, New York, 1967) for the planarity testing, and is a modification of Booth and Lueker’s (J. Comput. System Sci. 13 (1976), 335...
متن کامل